The 2-stage Euclidean algorithm and the restricted Nagataʼs pairwise algorithm
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe non-Euclidean Euclidean algorithm
In this paper we demonstrate how the geometrically motivated algorithm to determine whether a twogenerator real Möbius group acting on the Poincaré plane is or is not discrete can be interpreted as a non-Euclidean Euclidean algorithm. That is, the algorithm can be viewed as an application of the Euclidean division algorithm to real numbers that represent hyperbolic distances. In the case that t...
متن کاملThe Euclidean Algorithm
In this note a constructive criterion for the existence of a Euclidean algorithm within a given integral domain is derived, and from among the different possible Euclidean algorithms in an integral domain one is singled out. The same is done for "transfinite" Euclidean algorithms. The criterion obtained is applied to some special rings, in particular rings of quadratic integers. By an example i...
متن کاملThe Accelerated Euclidean Algorithm
We propose a new GCD algorithm called Accelerated Euclidean Algorithm, or AEA for short, which matches the O(n log n log log n) time complexity of the Schönhage algorithm for n-bit inputs. This new GCD algorithm is designed for both integers and polynomials. We only focus our study to the integer case, the polynomial case is currently addressed [3]. The algorithm is based on a half-gcd like pro...
متن کاملThe Euclidean Algorithm
Euclid’s algorithm gives the greatest common divisor (gcd) of two integers, gcd(a, b) = max{d ∈ Z | d|a, d|b} If for simplicity we define gcd(0, 0) = 0, we have a function gcd : Z× Z −→ N with the following properties: Lemma 1 For any a, b, c, q ∈ Z we have: (i) gcd(a, b) = gcd(b, a). (ii) gcd(a,−b) = gcd(a, b). (iii) gcd(a, 0) = |a|. (iv) gcd(a− qb, b) = gcd(a, b). Proof. Trivial; for (iv) use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2011
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2011.09.029